Perfection thickness of graphs
نویسندگان
چکیده
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
منابع مشابه
Propriétés géométriques du nombre chromatique : polyèdres, structures et algorithmes. (Geometric properties of the chromatic number : polyhedra, structure and algorithms)
Computing the chromatic number and finding an optimal coloring of a perfect graph can be done efficiently, whereas it is an NP-hard problem in general. Furthermore, testing perfection can be carriedout in polynomial-time. Perfect graphs are characterized by a minimal structure of their stable set polytope: the non-trivial facets are defined by clique inequalities only. Conversely, does a simila...
متن کاملt-Perfection Is Always Strong for Claw-Free Graphs
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect if this system is totally dual integral. It is an open problem whether t-perfection is equivalent to strong t-perfection. We prove the equivalence for the class of claw-free graphs.
متن کاملMAP Estimation, Message Passing, and Perfect Graphs
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optimality of such algorithms is only well established for singly-connected graphs and other limited settings. This article extends the set of graphs where MAP estimation is in P and where message passing recovers the exac...
متن کاملStrong T-Perfection of Bad-K4-Free Graphs
Abstract. We show that each graph not containing a bad subdivision of K4 as a subgraph, is strongly t-perfect. Here a graph G = (V, E) is strongly t-perfect if for each weight function w : V → Z+, the maximum weight of a stable set is equal to the minimum (total) cost of a family of vertices, edges, and circuits covering any vertex v at least w(v) times. By definition, the cost of a vertex or e...
متن کاملBerge graphs with chordless cycles of bounded length
A graph is called weakly triangulated if it contains no chordless cycle on ve or more vertices (also called hole) and no complement of such a cycle (also called antihole). Equivalently, we can deene weakly triangulated graphs as antihole-free graphs whose induced cycles are isomorphic either to C3 or to C4. The perfection of weakly triangulated graphs was proved by Hayward 3] and generated inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 215 شماره
صفحات -
تاریخ انتشار 2000